How Concurrent Logic Programming Could Benefit from Using Linda-like Operations
نویسندگان
چکیده
STRAND execution model may be extended with a set of Linda-like operations and a concept of tuple space. The STRAND tuple space is orthogonal to STRAND process pool. Processes may access STS objects without setting up a shared data structure connection rst. Connection is established only for the time of the call duration. There is a wide class of problems that could be programmed more easily and readably in the presented model. The presented extension of STRAND has been implemented and the performance of presented techniques has been evaluated. This study proved that the proposed approach may be implemented and eectively used. Important factors in BLOCKINuencing the eciency of the extended model have been examined. The extended model may in future have much better performance than it has now if the C code of commercial Linda implementations can be incorporated into the STRAND Abstract Machine.
منابع مشابه
Algebraic Properties of Idempotent Substitutions
This paper presents an algebra of idempotent substitutions whose operations have many properties. We provide an algorithm to compute these operations and we show how they are related to the standard composition. The theory of Logic Programming can be rewritten in terms of these new operations. The advantages are that both the operational and the declarative semantics of Horn Clause Logic can be...
متن کاملBranch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming
Integer linear programming has a long tradition in operations research and has produced a large number of impressive results during the last 40 years, see for example [37, 30]. Finite domain constraint programming is a promising new approach for solving complex combinatorial problems, which combines recent progress in programming language design, like constraint logic programming or concurrent ...
متن کاملVerifying Multran Programs with Temporal Logic
A coordinationstyle programminglanguage, Multran, and its temporal logic semantics are proposed. Multran uses Linda-like tuple space to coordinate concurrent transactions, which could be written in any language as long as they satisfy their preconditions and post-conditions. It has an intuitional presentation and enjoys a temporal logic semantics for program veriication. A Multran program can b...
متن کاملUsing Oz for College Timetabling
In this paper, we concentrate on a typical scheduling problem: the computation of a timetable for a German college. Like many other scheduling problems, this problem contains a variety of complex constraints and necessitates special-purpose search strategies. Techniques from Operations Research and traditional constraint logic programming are not able to express these constraints and search str...
متن کامل